Constructing complicated carbohydrates

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

4 Carbohydrates

Carbohydrates are the major source of energy in diets fed to dairy cattle and usually comprise 60 to 70 percent of the total diet. The main function of carbohydrates is to provide energy for rumen microbes and the host animal. A secondary, but essential, function of certain types of carbohydrates is to maintain the health of the gastrointestinal tract. The carbohydrate fraction of feeds is a co...

متن کامل

Coffee carbohydrates

This review summarises recent advances in the chemistry, physiology and molecular properties of coffee carbohydrates with a particular focus on the cell wall polysaccharides. The results of detailed chemical studies have demonstrated novel structural features of both the galactomannans and the arabinogalactan polysaccharides of the green and roasted coffee bean. For the first time immunological...

متن کامل

Constructing vertex decomposable graphs

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

متن کامل

Constructing cryptographic definitions

This paper mirrors an invited talk to ISCISC 2011. It is not a conventional paper so much as an essay summarizing thoughts on a little-talked-about subject. My goal is to intermix some introspection about definitions with examples of them, these examples drawn mostly from cryptography. Underpinning our discussion are two themes. The first is that definitions are constructed. They are i...

متن کامل

Constructing Graceful Graphs with Caterpillars

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Methods

سال: 2013

ISSN: 1548-7091,1548-7105

DOI: 10.1038/nmeth.2677